Sufficient Spectral Conditions for Hamiltonicity
نویسنده
چکیده
The question of deciding whether or not a given graph is Hamiltonian is a very difficult one; indeed, determining whether a given graph is Hamiltonian is NP-complete. Here, we discuss applications of spectral graph theory to this problem. In particular, we explore results by Fiedler and Nikiforov [2] regarding spectral conditions on the adjacency matrix to ensure Hamiltonicity, and results by Butler and Chung [1] regarding sufficient spectral conditions on the combinatorial Laplacian to ensure Hamiltonicity. It appears that there are no known results linking the normalized Laplacian to the property of Hamiltonicity.
منابع مشابه
Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to deter...
متن کاملRecent research in Graph Theory
A well-known and fundamental property of graphs is Hamiltonicity. A connected graph is Hamiltonian if it contains a spanning cycle. Determining if a graph is Hamiltonian is known as a NP-complete problem and no satisfactory characterization exists. Nevertheless, many sufficient conditions for Hamiltonicity were found, usually expressed in terms of degree, connectivity, density, toughness, indep...
متن کاملOn the hamiltonicity of the cartesian product
We examine the hamiltonicity of the cartesian product P = G1 ×G2 of two graphs G1, G2. We provide necessary and/or sufficient conditions for P to be hamiltonian, depending on the hamiltonian properties of G1 and G2, with corresponding constructions. We also prove a conjecture by Batagelj and Pisanski related to the ‘cyclic hamiltonicity’ of a graph.
متن کاملSpectral radius and Hamiltonicity of graphs with large minimum degree
We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. Let G be a graph of order n and λ (G) be the spectral radius of its adjacency matrix. One of the main results of the paper is the following theorem: Let k 2, n k3 + k + 4, and let G be a graph of order n, with minimum degree δ (G) k. If λ (G) n k 1, then G has a Hamiltonian cycle, unless G = K1 _ (Kn k...
متن کاملA sufficient condition for Hamiltonicity in locally finite graphs
Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.
متن کامل